A Programming Methodology for Dual-Tier Multicomputers

Hierarchically-organized ensembles of shared memory multiprocessors possess a richer and more complex model of locality than previous generation multicomputers with single processor nodes. These dual-tier computers introduce many new factors into the program-mer's performance model. We present a methodology for implementing block-structured numerical applications on dual-tier computers, and a run-time infrastructure, called KeLP2, that implements the methodology. KeLP2 supports two levels of locality and parallelism via hierarchical SPMD control ow, run-time geometric meta-data, and asynchronous collective communication. KeLP applications can eeectively overlap communication with computation under conditions where non-blocking point-to-point message passing fails to do so. KeLP's abstractions hide considerable detail without sacriicing performance, and dual-tier applications written in KeLP consistently outperform equivalent single-tier implementations written in MPI. We describe the KeLP2 model and show how it facilitates the implementation of ve block-structured applications specially formulated to hide communication latency on dual-tiered architectures. We support our arguments with empirical data from running the applications on various single-and dual-tier multicomputers. KeLP2 supports a migration path from single-tier to dual-tier platforms, and we illustrate this capability with a detailed programming example.